Equalization of transmit diversity space-time coded signals

ABSTRACT

In connection with transmitted space-time, trellis encoded, signals that pass through a transmission channel that is characterized by memory, improved performance is realized with a receiver that combines a decoder with an equalizer that selects the trellis transition, s, that minimizes the metric 
     
       
         
           
             
               
                 ξ 
                 j 
               
                
               
                 ( 
                 k 
                 ) 
               
             
             = 
             
               
                  
                 
                   
                     r 
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                   - 
                   
                     
                       ∑ 
                       
                         l 
                         = 
                         
                           
                             L 
                             1 
                           
                           + 
                           1 
                         
                       
                       
                         L 
                         1 
                       
                     
                      
                     
                         
                     
                      
                     
                       
                         
                           
                             h 
                             ~ 
                           
                           j 
                         
                          
                         
                           ( 
                           l 
                           ) 
                         
                       
                        
                       
                         
                           s 
                           ~ 
                         
                          
                         
                           ( 
                           
                             k 
                             - 
                             l 
                           
                           ) 
                         
                       
                     
                   
                   - 
                   
                     
                       ∑ 
                       
                         l 
                         = 
                         
                           
                             L 
                             1 
                           
                           + 
                           1 
                         
                       
                       
                         L 
                         + 
                         1 
                       
                     
                      
                     
                         
                     
                      
                     
                       
                         
                           
                             h 
                             ~ 
                           
                           j 
                         
                          
                         
                           ( 
                           l 
                           ) 
                         
                       
                        
                       
                         
                           s 
                           ^ 
                         
                          
                         
                           ( 
                           
                             k 
                             - 
                             l 
                           
                           ) 
                         
                       
                     
                   
                 
                  
               
               2 
             
           
         
       
     
     where {tilde over (h)} j (l) is related to both the transmission channel and to the encoding structure in the transmitter, {tilde over (s)}(k) are the (trial) symbols according to a certain transition and ŝ(k) are the symbols that were previously decided.

RELATED APPLICATION

The application is a Continuation of Ser. No. 11/210,287 filed in the United States Patent Office Aug. 25, 2005. This application is also related to 09/687,238 filed in the United States Patent Office Oct. 13, 2008, which claims priority from Provisional application No. 60/196,599, filed Apr. 13, 2000.

BACKGROUND

This invention relates to multi-antenna receivers.

Future wireless communications systems promise to offer a variety of multimedia services. To fulfill this promise, high data rates need to be reliably transmitted over wireless channels. The main impairments of wireless communication channels are time varying fading due to multipath propagation, and time dispersion. The multipath fading problem can be solved through antenna diversity, which reduces the effects of multipath fading by combining signals from spatially separated antennas. The time dispersion problem can be solved by equalization, such as linear, decision feedback, and maximum likelihood sequence estimation (MLSE).

It has been a standard practice to use multiple antennas at the receiver with some sort of combining of the received signals, e.g., maximal ratio combining. However, it is hard to efficiently use receive antenna diversity at remote units, e.g., cellular phones, since they typically need to be relatively simple, small, and inexpensive. Therefore, receive antenna diversity and array signal processing with multiple antennas have been almost exclusively used (or proposed) for use at the base station, resulting in an asymmetric improvement of the reception quality only in the uplink.

Recently, there have been a number of proposals that use multiple antennas at the transmitter with the appropriate signal processing to jointly combat the above wireless channel impairments and provide antenna diversity for the downlink while placing most of the diversity burden on the base station. Substantial benefits can be achieved by using channel codes that are specifically designed to take into account multiple transmit antennas. The first bandwidth efficient transmit diversity scheme was proposed by Wittneben and it included the transmit diversity scheme of as a special case. See N. Seshadri and J. H. Winters, “Two Schemes for Improving the Performance of Frequency-Division Duplex (FDD) Transmission Systems Using Transmitter Antenna Diversity,” International Journal of Wireless Information Networks, vol. 1, pp. 49-60, January 1994. In V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-Time Codes for High Data Rate Wireless Communications Performance Criterion and Code Construction,” IEEE Trans. Inform. Theory, pp. 744-765, March 1998, space-time trellis codes were introduced, where a general theory for design of combined trellis coding and modulation for transmit diversity is proposed. An input symbol to the space-time encoder is mapped into N modulation symbols, and the N symbols are transmitted simultaneously from N transmit antennas, respectively. These codes were shown to achieve the maximal possible diversity benefit for a given number of transmit antennas, modulation constellation size, and transmission rate. Another approach for space-time coding, space-time block codes, was introduced by S. Alamouti, in “Space Block Coding: A Simple Transmitter Diversity Technique for Wireless Communications,” IEEE Journal on Selec. Areas. Commun., vol. 16, pp. 1451-1458, October 1998 and later generalized by V. Tarokh, H. Jafarkhani, and R. A. Calderbank, in “Space Time block Codes From Orthogonal Designs,” IEEE Trans. Inform. Theory, vol. 45, pp. 1456-1467, July 1999.

Space-time codes have been recently adopted in third generation cellular standard (e.g. CDMA-2000 and W-CDMA). The performance analysis of the space-time codes in the above-mentioned articles was done assuming a flat fading channel. Analysis shows that the design criteria of space-time trellis codes is still optimum when used over a frequency selective channel, assuming that the receiver performs the optimum matched filtering for that channel. In addition, although the space-time coding modem described in A. F. Naguib, V. Tarokh, N. Seshadri and A. R. Calderbank, “A Space-Time Coding Based Modem for High Data Rate Wireless Communications,” IEEE Journal on Selec. Areas Commun., vol. 16, pp. 1459-1478, October 1998 was designed assuming a flat fading channel, it performed remarkably well when used over channels with delay spreads that are relatively small as compared to the symbol period T_(s). However, when the delay spread is large relative to the symbol period, e.g., ≧T_(s)/4, there was a severe performance degradation.

SUMMARY

In connection with transmitted space-time, trellis encoded, signals that pass through a transmission channel that is characterized by memory, improved performance is realized with a receiver that combines a decoder with an equalizer that selects the trellis transition, s, that minimizes the metric

${\xi_{j}(k)} = {{{r(k)} - {\sum\limits_{l = {L_{1} + 1}}^{L_{1}}\; {{{\overset{\sim}{h}}_{j}(l)}{\overset{\sim}{s}\left( {k - l} \right)}}} - {\sum\limits_{l = {L_{1} + 1}}^{L + 1}\; {{{\overset{\sim}{h}}_{j}(l)}{\hat{s}\left( {k - l} \right)}}}}}^{2}$

where {tilde over (h)}_(j)(l) is related to both the transmission channel and to the encoding structure in the transmitter, {tilde over (s)}(k) are the (trial) symbols according to a certain transition and ŝ(k) are the symbols that were previously decided.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a transmitter having a plurality of antennas, and a receiving having a plurality of antennas, where the transmission channel between them includes memory;

FIG. 2 illustrates a particular trellis structure for the trellis encoder shown in the FIG. 1 transmitter; and

FIG. 3 is an advantageous constellation mapping.

DETAILED DESCRIPTION

FIG. 1 presents the general scenario of a transmitter 10 having N transmit antennas, for example 11-1, and 11-2, and a receiver 20 with 21-1, 21-2, . . . 21-M receive antennas, in a frequency selective Rayleigh fading environment. The M receive antennas are coupled to equalizer/decoder 23, equalizer/decoder 23 is coupled to symbol-to-bits mapper 25, and mapper 25 is connected to an outer-code decoder 27 (if the signal transmitted by transmitter 10 is encoded with an outer-code encoder—as shown in transmitter 10). The design and operation of equalizer/decoder, which may be implemented with a conventional digital signal processor, is the subject of this disclosure,

Generally, the impulse response of the transmission channel between the i-th transmitting to the j-th receiving antennas, when modeled with a time varying FIR impulse response, is

$\begin{matrix} {{{g_{ij}(k)} = {\sum\limits_{l = 0}^{L}\; {{h_{ij}\left( {k,l} \right)}{\delta \left( {k - 1} \right)}}}},} & (1) \end{matrix}$

which includes the effects of the transmitter and receiver pulse shaping filters and the physical multipath channel. Equation (1) incorporates the notion that for various reasons, such as a plurality of different-distance paths, the transmission channel includes memory. Without loss of generality, it is assumed that the channel model order (i.e., the channel's memory) is L+1. It is also assumed that the channel parameters {h_(ij)(k,l), i= . . . M} are invariant within a data burst, although they may be varying from burst to burst. In cellular systems such as GSM, the length of a data burst is about of 0.58 ms, and compared to the coherence time of the channel at 60 MPH mobile velocity, which is approximately 12.5 ms, the burst length is small enough such that the block time-invariant channel model is valid. This assumption is satisfied in most of the GSM environment.

The h_(ij)(k,l) elements are modeled as iid complex Gaussian random variables with zero mean and variance σ_(h) ²(l), and the channel is assumed to be passive; that is

$\begin{matrix} {{\sum\limits_{l = 0}^{L}\; {\sigma_{h}^{2}(l)}} = 1.} & (2) \end{matrix}$

When s(k) is the signal that is applied to time-space encoder 19 of FIG. 1, the corresponding output is {c₁(k), c₂(k), . . . , c_(N)(k)}, where c_(i)(k) is the code symbol transmitted from antenna i at time k. The received signal at receive antenna j can be expressed by:

$\begin{matrix} {{{r_{j}(k)} = {{\sum\limits_{i = l}^{N}{\sum\limits_{l = 0}^{L}\; {{h_{ij}(l)}{c_{i}\left( {k - 1} \right)}}}} + {n_{j}(k)}}},{1 \leq j \leq M},} & (3) \end{matrix}$

where n_(j)(k) is a sequence of iid complex Gaussian noise samples with zero mean and variance σ_(n) ². One of the summations in equation (3) can be put in a matrix form, to yield

$\begin{matrix} {{{r_{j}(k)} = {{\sum\limits_{i = 1}^{N}{g_{ij} \cdot {c_{i}(k)}}} + {n_{j}(k)}}},} & (4) \end{matrix}$

where g_(ij)=[h_(ij)(0)h_(ij)(1) . . . h_(ij)(L)] and c_(i)(k)=[c_(i)(k)c_(i)(k−1) . . . c_(i)(k−L)]^(T). The output of the M receive antennas at time k can thus be expressed by

$\begin{matrix} \begin{matrix} {{r(k)} = \left\lbrack {{r_{1}(k)}{r_{2}(k)}\mspace{20mu} \ldots \mspace{14mu} {r_{M}(k)}} \right\rbrack^{T}} \\ {= {{\sum\limits_{i = 1}^{n}\; {H_{i} \cdot {c_{i}(k)}}} + {{n(k)}\mspace{14mu} {where}}}} \\ {{n(k)} = \left\lbrack {{n_{1}(k)}{n_{2}(k)}\mspace{14mu} \ldots \mspace{14mu} {n_{M}(k)}} \right\rbrack^{T}} \\ {{H_{i} = {\begin{bmatrix} g_{i\; 1} \\ g_{i\; 2} \\ \vdots \\ g_{iM} \end{bmatrix} = \left\lbrack {{h_{i}(0)}{h_{i}(1)}\mspace{14mu} \ldots \mspace{14mu} {h_{i}(L)}} \right\rbrack}},{and}} \\ {{h_{i}(l)} = {\left\lbrack {{h_{i1}(l)}{h_{i2}(l)}\mspace{14mu} \ldots \mspace{14mu} {h_{iM}(l)}} \right\rbrack^{T}.}} \end{matrix} & (5) \end{matrix}$

The noise vector n(k) has a zero mean and covariance R_(n)=σ_(n) ²·I_(M×M).

Extending equation (5) to a D+1 sequence of received signals (e.g., a D-stage shift register, yielding D+1 taps), a vector x(k) can be considered that can be expressed by

x(k)=[r(k)^(T) r(k−1)^(T) . . . r(k−D)^(T)]^(T).

The new space-time data model is then given by

$\begin{matrix} {{x(k)} = {{\sum\limits_{i = 1}^{N}\; {\cdot {{\overset{\_}{c}}_{i}(k)}}} + {\overset{\_}{n}(k)}}} & (6) \end{matrix}$

where c _(i)(k)=[c_(i)(k), c_(i)(k−1), . . . , c_(i)(k−L−D)]^(T), n(k)=[n(k)^(T)n(k−1)^(T) . . . n(k−L)^(T) ]T, and

$\begin{matrix} {= \begin{bmatrix} {H_{i}\mspace{11mu} \ldots \mspace{14mu} 0} \\ \ddots \\ {0\mspace{14mu} \ldots \mspace{14mu} H_{i}} \end{bmatrix}} & (7) \end{matrix}$

is an M(D+1)×(L+D+1) matrix. The noise vector n(k) has a zero mean and covariance R_(n)−=σ_(n) ²·I_(M(D+1)×M(D+1)).

With the above analysis in mind, one might consider the situation where the mapper 14 is an 8-PSK 8-state mapper, followed by a trellis encoder 16 whose output is applied to space-time coder 19. The input to coder 19 forms a first output of the space-time coder, and is applied to antenna 11-1. This input is also applied to delay element 17 and thence to multiplier 18, which creates a second output of the space-time coder. That second output is applied to antenna 11-2. Multiplier 18 multiplies the mapped signal by −1 (rotates it by 180) when the symbol applied to multiplier 18 is odd. Advantageously, the mapping within element 14 is as depicted in FIG. 3; that is, traversing the unit circle counterclockwise starting with 0, the sequence of mappings is {0,7,6,1,5,2,3,4}.

The trellis of encoder 16 is shown in FIG. 2. For this arrangement, the input bit stream is grouped into group of three bits each and each group is mapped into one of the 8 constellation points, which are also states of the trellis encoder. The column to the left of the trellis is the state label and each row to the right of the trellis represents the edge labels for transitions from the corresponding state. An edge label c₁c₂ indicates that symbol c₁ is transmitted from the first antenna and symbol c₂ is transmitted from second antenna. To illustrate, assuming that the encoder starts from state ‘0’—which is the conventional assumption—if the input sequence is {0 1 5 7 6 4} then operating pursuant to the FIG. 2 trellis yields the sequence {0 1 5 7 6 4} that is transmitted over the first antenna and the sequence {0 0 5 1 3 6} that is transmitted over the second antenna.

For data rates on the order of the coherence bandwidth of the channel, or larger, an equalizer needs to be used to compensate for the intersymbol interference induced by the resolvable multipath receptions. There are two basic, yet powerful, equalization techniques that are used for equalization over wireless channels: the probabilistic symbol-by-symbol MAP algorithm, which provides the MAP-probabilities for each individual symbol, and the Viterbi algorithm (VA), which is a maximum likelihood sequence estimator (MLSE) that outputs the ML-channel path. Both techniques have the advantage that they gather energy from all channel tap gains (therefore taking full advantage of the diversity gain offered by the multipath propagation) without suffering from noise enhancement or error propagation. This is rather an important feature because in wireless propagation environments the reflections may be stronger than the direct path. The main problem of both approaches, however, is their complexity in terms of the equalizer states. For example, in case of space-time coding with N transmit antennas and a channel response with length L+1, the number of equalizer states will be (

^(N))^(L), where

is the number of constellation points. That is, the equalizer complexity is exponential in terms of number of transmit antennas and channel memory.

The equalizer complexity problem can be solved by using a reduced complexity approach by M. V. Eyuboglu and S. U. Qureshi, in “Reduced-State Sequence Estimation with Set Partitioning and Decision Feedback,” IEEE Trans. Commun., vol. COM-36, pp. 12-20, January 1988. However, reduced complexity techniques suffer from performance degradation if the channel response is not minimum phase, or nearly so. Since wireless channels are time varying and hence the minimum phase condition is not guaranteed all the time, a whitened matched filter or a pre-curser equalizer must be used to render the channel minimum phase all the time. Although designing a whitened matched filter is well known for the classical equalization problem, it is not known for space-time coding with transmit diversity. This is because, as mentioned earlier, the received signal at the receiver is the superposition of all transmitted signals that propagated through totally independent channels. Consequently, the job of the whitened matched filter in this case is to render all of these channels minimum phase at the same time; and it is not known how to achieve this.

To overcome this problem, the following discloses a reduced complexity approach that uses the structure that is present in some space-time trellis codes, such as the one presented in FIG. 2.

Defining s(k)≡[s(k) s(k−1) . . . s(k−L)]^(T), from FIG. 2 is can be seen that the code symbols to be transmitted from the first antenna (at time k, k−1, . . . , k−L) are c₁(k)=[s(k) s(k−1) . . . s(k−L)]^(T) and, hence, c₁(k)=s(k). The corresponding code symbols to be transmitted from the second antenna can be expressed by

c ₂(k)=S·s(k−1)

where S=diag {f(l))}_(l≡1 . . . L+1) and

$\begin{matrix} {{f(l)} = {1 - {2 \star {{mod}\left( {\frac{\angle \; {s\left( {k - 1} \right)}}{\pi/4},2} \right)}}}} & (8) \end{matrix}$

Hence, the received signal vector at the M receive antennas in (5) can be rewritten as

$\begin{matrix} \begin{matrix} {{r(k)} = {{H_{1} \cdot {s(k)}} + {H_{2} \cdot S \cdot {s\left( {k - 1} \right)}} + {n(k)}}} \\ {= {{\left( {\left\lbrack {H_{1}{\vdots 0}} \right\rbrack + \left\lbrack {0{{\vdots S} \cdot H_{2}}} \right\rbrack} \right)\begin{bmatrix} {s(k)} \\ \vdots \\ {s\left( {k - 1} \right)} \end{bmatrix}} + {n(k)}}} \end{matrix} & (9) \end{matrix}$

For the j-th receive antenna, this reduces to

$\begin{matrix} {{{r_{j}(k)} = {{\sum\limits_{l = 0}^{L + 1}{{{\overset{\sim}{h}}_{j}(l)}{s\left( {k - l} \right)}}} + {n(k)}}}{where}} & (10) \\ {{{\overset{\sim}{h}}_{j}(l)} = \left\{ {\begin{matrix} {{h_{1j}(0)}} \\ {{{h_{1j}(l)} + {{f(l)} \cdot {h_{2j}\left( {l - 1} \right)}}}} \\ {{{f\left( {L + 1} \right)} \cdot {h_{2j}(L)}}} \end{matrix}\begin{matrix} {{l = 0}} \\ {{l = {1\mspace{14mu} \ldots \mspace{14mu} L}}} \\ {{l = {L + 1}}} \end{matrix}} \right.} & (11) \end{matrix}$

Note that the delay diversity case for 8-PSK with 2 transmit antenna can be obtained by setting f(l)=1∀l in equations (9), (10), and (11). Using equation (10), a branch metric for the j-th receive antenna at time k in a reduced-complexity MLSE is

$\begin{matrix} {{\xi_{j}(k)} = {{{r(k)} - {\sum\limits_{l = {L_{1} + 1}}^{L_{1}}\; {{{\overset{\sim}{h}}_{j}(l)}{\overset{\sim}{s}\left( {k - l} \right)}}} - {\sum\limits_{l = {L_{1} + 1}}^{L + 1}\; {{{\overset{\sim}{h}}_{j}(l)}{\hat{s}\left( {k - l} \right)}}}}}^{2}} & (12) \end{matrix}$

where {tilde over (s)}(k) are the (trial) symbols according to a certain transition and ŝ(k) are the previous symbols along the path history. Under some circumstances, a modification of the equation (12) metric may be employed, which provides a delayed decision. The modified metric can be expressed by

$\begin{matrix} {{\xi_{j}(k)} = {{{r\left( {k - 1} \right)} - {\sum\limits_{l = 0}^{L_{1}}\; {{{\overset{\sim}{h}}_{j}(l)}{\overset{\sim}{s}\left( {k - l} \right)}}} - {\sum\limits_{l = {L_{1} + 1}}^{L + 1}\; {{{\overset{\sim}{h}}_{j}(l)}{\hat{s}\left( {k - l} \right)}}}}}^{2}} & (13) \end{matrix}$

The total path metric for the M receive antennas will be

$\begin{matrix} {{\xi (k)} = {\sum\limits_{j = 1}^{M}{{\xi_{j}(k)}.}}} & (14) \end{matrix}$

In short, equalizer/MSE decoder 23 within receiver 20 needs to obtains an estimate of the transmission channel parameters in a conventional way, e.g., through use of training sequences sent by the transmitter, and proceed to decode received symbols by selecting as the transmitted signal that signal which minimizes the equation (12) metric. 

1. A receiver comprising: a front-end stage for receiving an input signal and providing at time k a signal r(k); a processing stage responsive to said signal r(k) that selects as a signal transmitted by a transmitter a signal that minimizes the following equation metric ${\xi_{j}(k)} = {{{r(k)} - {\sum\limits_{l = {L_{1} + 1}}^{L_{1}}\; {{{\overset{\sim}{h}}_{j}(l)}{\overset{\sim}{s}\left( {k - l} \right)}}} - {\sum\limits_{l = {L_{1} + 1}}^{L + 1}\; {{{\overset{\sim}{h}}_{j}(l)}{\hat{s}\left( {k - l} \right)}}}}}^{2}$ where {tilde over (h)}_(j)(l) is related to both a transmission channel through which said input signal arrived at said front-end stage and to an encoding structure in a transmitter that causes said input signal to arrive at said front-end stage, {tilde over (s)}(k) is a trial symbols specified by a selected trellis transition and ŝ(k) is a symbol that was previously decided; and a decoder responsive to said processing stage for decoding received symbols.
 2. A receiver comprising: a front-end stage for receiving an input signal and providing at time k a signal r(k); a processing stage responsive to said signal r(k) that selects as a signal transmitted by a transmitter a signal that minimizes a metric that involves {tilde over (h)}_(j)(l), which is related to both a transmission channel through which said input signal arrived at said front-end stage and to an encoding structure in a transmitter that causes said input signal to arrive at said front-end stage, to trial symbols specified by selected trellis transitions, and previously decided symbols; and a decoder responsive to said processing stage for decoding received symbols. 